Knapsack Problem Publications

Publications in Knapsack Problem

Explore the most influential research papers and scholarly works that have shaped Knapsack Problem. Use the concept filter below to focus on a specific sub-area of research.

Knapsack Problem

1.4K

Publications

70.6K

Citations

Showing yearly statistics from 2000-2026.

Page 1

	Year	Citations
Knapsack problems, algorithms and computer implementations Jeroen De Kort European Journal of Operational Research Mathematical ProgrammingEngineeringInteger OptimizationCombinatorial ProblemDiscrete Optimization	1991	1.4K
A Linear Programming Approach to the Cutting Stock Problem—Part II Paul C. Gilmore, Ralph E. Gomory Operations Research Mathematical ProgrammingEngineeringLogistics OptimizationIndustrial EngineeringSmart Manufacturing	1963	1.1K
Hiding information and signatures in trapdoor knapsacks Ralph C. Merkle, Martin E. Hellman IEEE Transactions on Information Theory Cryptographic PrimitiveEngineeringInformation SecurityInformation ForensicsComputational Complexity	1978	810
Multistage Cutting Stock Problems of Two and More Dimensions Paul C. Gilmore, Ralph E. Gomory Operations Research Mathematical ProgrammingEngineeringLogistics OptimizationInventory TheoryBranch And Cut	1965	792
A note on maximizing a submodular set function subject to a knapsack constraint Maxim Sviridenko Operations Research Letters Mathematical ProgrammingEngineeringOptimization ProblemKnapsack ProblemConstrained Optimization	2003	680
Integer Programming: Methods, Uses, Computations Michel Balinski Management Science Mathematical ProgrammingCutting Plane MethodsBranch-and-bound AlgorithmEngineeringComputational Complexity	1965	614
The Theory and Computation of Knapsack Functions Paul C. Gilmore, Ralph E. Gomory Operations Research Mathematical ProgrammingOperations ResearchKnapsack FunctionsOne-dimensional Knapsack FunctionEngineering	1966	605
Computing Partitions with Applications to the Knapsack Problem Ellis Horowitz, Sartaj Sahni Journal of the ACM Mathematical ProgrammingSearch OptimizationBranch-and-bound AlgorithmEngineeringComputational Complexity	1974	558
Computational Complexity of the Capacitated Lot Size Problem Gabriel R. Bitran, Horácio Hideki Yanasse Management Science Mathematical ProgrammingEngineeringParticular Cost StructureSingle Item ProblemCombinatorial Problem	1982	532
An Algorithm for Large Zero-One Knapsack Problems Egon Balas, Eitan Zemel Operations Research Mathematical ProgrammingEngineeringComputational ComplexityDiscrete OptimizationOperations Research	1980	469
On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment Andrzej Jaszkiewicz IEEE Transactions on Evolutionary Computation Memetic AlgorithmEngineeringEvolutionary ProgrammingGenetic AlgorithmMultiple-objective Evolutionary Algorithms	2002	467
The multidimensional 0–1 knapsack problem: An overview Arnaud Fréville European Journal of Operational Research Mathematical ProgrammingEngineeringInteger OptimizationCombinatorial ProblemDiscrete Optimization	2003	445

Page 1